Operationally-based program equivalence proofs using LCTRSs

Operationally-Based Theories of Program Equivalence

Program Equivalence Using Neural Networks

Program equivalence refers to the mapping between equivalent codes written in different languages – including high-level and lowlevel languages. In the present work, we propose a novel approach for correlating program codes of different languages using artificial neural networks and program characteristics derived from control flow graphs and call graphs. Our approach correlates the program cod...

Completely Automated Equivalence Proofs

Verifying partial (i.e., termination-insensitive) equivalence of programs has significant practical applications in software development and education. Conventional equivalence verifiers typically rely on a combination of given relational summaries and suggested synchronization points; such information can be extremely difficult for programmers without a background in formal methods to provide ...

Planning Equivalence Proofs

Di erent axiomatizations of mathematical concepts prove to be useful in a mathematical knowledge base, since each axiomatization of a concept is more or less helpful for the task at hand. To keep the knowledge base consistent, the equivalence of distinct de nitions for some concept must be formally proven. Especially in algebra, where various axiomatizations of an algebraic structure often occu...

Short Proofs of Tautologies Using the Schema of Equivalence

It is shown how the schema of equivalence can be used to obtain short proofs of tautologies A, where the depth of proofs is linear in the number of variables in A. Eq (A, B, C arbitrary formulas) is the propositional pendant of the schema of identity. It can be argued that, apart form the usual propositional tautologies and inference schemas which are given as axiomatizations of propositional l...